Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, and Rotem Oshman. Quantum Distributed Algorithms for Detection of Cliques. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 35:1-35:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{censorhillel_et_al:LIPIcs.ITCS.2022.35, author = {Censor-Hillel, Keren and Fischer, Orr and Le Gall, Fran\c{c}ois and Leitersdorf, Dean and Oshman, Rotem}, title = {{Quantum Distributed Algorithms for Detection of Cliques}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {35:1--35:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.35}, URN = {urn:nbn:de:0030-drops-156319}, doi = {10.4230/LIPIcs.ITCS.2022.35}, annote = {Keywords: distributed graph algorithms, quantum algorithms, cycles, cliques, Congested Clique, CONGEST} }
Published in: LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Keren Censor-Hillel, Dean Leitersdorf, and Volodymyr Polosukhin. Distance Computations in the Hybrid Network Model via Oracle Simulations. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 21:1-21:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{censorhillel_et_al:LIPIcs.STACS.2021.21, author = {Censor-Hillel, Keren and Leitersdorf, Dean and Polosukhin, Volodymyr}, title = {{Distance Computations in the Hybrid Network Model via Oracle Simulations}}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)}, pages = {21:1--21:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-180-1}, ISSN = {1868-8969}, year = {2021}, volume = {187}, editor = {Bl\"{a}ser, Markus and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.21}, URN = {urn:nbn:de:0030-drops-136663}, doi = {10.4230/LIPIcs.STACS.2021.21}, annote = {Keywords: Distributed graph algorithms, Hybrid network model, Distance computations} }
Published in: LIPIcs, Volume 179, 34th International Symposium on Distributed Computing (DISC 2020)
Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, and Rotem Oshman. Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 33:1-33:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{censorhillel_et_al:LIPIcs.DISC.2020.33, author = {Censor-Hillel, Keren and Fischer, Orr and Gonen, Tzlil and Le Gall, Fran\c{c}ois and Leitersdorf, Dean and Oshman, Rotem}, title = {{Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {33:1--33:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.33}, URN = {urn:nbn:de:0030-drops-131115}, doi = {10.4230/LIPIcs.DISC.2020.33}, annote = {Keywords: distributed graph algorithms, cycles, girth, Congested Clique, CONGEST} }
Published in: LIPIcs, Volume 125, 22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Keren Censor-Hillel, Dean Leitersdorf, and Elia Turner. Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model. In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 125, pp. 4:1-4:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{censorhillel_et_al:LIPIcs.OPODIS.2018.4, author = {Censor-Hillel, Keren and Leitersdorf, Dean and Turner, Elia}, title = {{Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model}}, booktitle = {22nd International Conference on Principles of Distributed Systems (OPODIS 2018)}, pages = {4:1--4:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-098-9}, ISSN = {1868-8969}, year = {2019}, volume = {125}, editor = {Cao, Jiannong and Ellen, Faith and Rodrigues, Luis and Ferreira, Bernardo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2018.4}, URN = {urn:nbn:de:0030-drops-100645}, doi = {10.4230/LIPIcs.OPODIS.2018.4}, annote = {Keywords: congested clique, matrix multiplication, triangle listing} }
Feedback for Dagstuhl Publishing